Showing items 1 - 14 of 14

Your selections:

Minimum rank and zero forcing number for butterfly networks

Zero forcing in iterated line digraphs

A lower bound on the zero forcing number

On the power domination number of de Bruijn and Kautz digraphs

Zero forcing and power domination in graphs

On the partition dimension of circulant graphs

The metric dimension of the circulant graph C(n,±{1,2,3,4})

Average distance in interconnection networks via reduction theorems for vertex-weighted graphs

On the energy of certain recursive structures

On the strong metric dimension of tetrahedral diamond lattice

Power domination in certain chemical structures

Resolving-power dominating sets

On the metric dimension of circulant and Harary graphs

On the partition dimension of a class of circulant graphs

  • 1
  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit